Lutz-Peter Hooge <lpv### [at] gmxde> wrote:
>>   I think that the problem would be knowing which bounding box is the nearest.
>> This isn't necessarily an unambiguous thing.

> The intersections with all bounding boxes will have to be computed anyway 
> I think?

  The problem is that even when bounding box A has one side closer to
the initial point of the ray than any of the sides of bounding box B, the
intersection of the ray with the object inside B could be closer than the
one inside A (although I think this can be the case only with overlapping
bounding boxes or a bounding box containing another bounding box).

-- 
#macro M(A,N,D,L)plane{-z,-9pigment{mandel L*9translate N color_map{[0rgb x]
[1rgb 9]}scale<D,D*3D>*1e3}rotate y*A*8}#end M(-3<1.206434.28623>70,7)M(
-1<.7438.1795>1,20)M(1<.77595.13699>30,20)M(3<.75923.07145>80,99)// - Warp -

Post a reply to this message